Natural deduction - PDFSEARCH.IO - Document Search Engine

Natural deduction
Results: 402

#	Item
131	The λΠ-calculus Modulo as a Universal Proof Language Mathieu Boespflug1 , Quentin Carbonneaux2 and Olivier Hermant3 1 2 Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2012-07-25 10:49:31 Mathematics Lambda calculus Dependently typed programming Logic in computer science Proof theory Natural deduction Curry–Howard correspondence Calculus of constructions Type system Type theory Programming language theory Theoretical computer science
132	A Shallow Embedding of Resolution and Superposition Proofs into the λΠ-Calculus Modulo∗ Guillaume Burel ´ ENSIIE/C´ Add to Reading List Source URL: bware.lri.fr Language: English - Date: 2014-09-27 11:17:21 Symbol Mathematics Curry–Howard correspondence Logic Natural deduction Proof theory Logic in computer science Mathematical logic
133	On the Amortized Complexity of Zero-knowledge Protocols Ronald Cramer? , Ivan Damg˚ ard?? , and Marcel Keller? ? ? CWI/Leiden University, Aarhus University, and University of Bristol Abstract. We propose a general tech Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-05-09 09:29:46 IP Symbol Zero-knowledge proof Commitment scheme Sheaf Natural deduction Interactive proof system Cryptography Cryptographic protocols Proof of knowledge
134	Towards Normalization by Evaluation for the βη-Calculus of Constructions (Extended Version) Andreas Abel Project PI.R2, INRIA Rocquencourt and PPS, Paris Add to Reading List Source URL: www2.tcs.ifi.lmu.de Language: English - Date: 2011-02-18 18:03:19 Mathematical logic Lambda calculus Normalisation by evaluation Valuation Natural deduction Curry–Howard correspondence Abstract algebra Mathematics Proof theory
135	ZU064-05-FPR linearpi 20 December 2013 Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2014-03-17 07:07:57 Proof theory Deduction Propositional calculus Logic in computer science Non-classical logic Natural deduction Function Π-calculus Curry–Howard correspondence Logic Mathematical logic Mathematics
136	Under consideration for publication in Math. Struct. in Comp. Science Transcendental syntax I: deterministic case Jean-Yves Girard Revised March 31, 2015 Add to Reading List Source URL: iml.univ-mrs.fr Language: English - Date: 2015-04-07 01:47:10 Transcendental number Function Natural deduction Mathematical proof Entailment Free variables and bound variables Logic Mathematics Deduction
137	J. Autom. Reasoning manuscript No. (will be inserted by the editor) Semi-intelligible Isar Proofs from Machine-Generated Proofs Jasmin Christian Blanchette · Sascha Böhme · Mathias Fleury · Steffen Juilf Smolka · Add to Reading List Source URL: www21.in.tum.de Language: English - Date: 2015-01-25 16:18:54 Automated theorem proving Proof theory Mathematical proofs Logical syntax First-order logic Proof assistant Theorem Isabelle Natural deduction Logic Mathematics Mathematical logic
138	Theoretical Informatics and Applications Will be set by the publisher Informatique Th´ eorique et Applications Add to Reading List Source URL: www2.tcs.ifi.lmu.de Language: English - Date: 2005-06-20 12:22:00 Recursion Proof theory Computability theory Logic in computer science Lambda calculus Symbol Natural deduction Curry–Howard correspondence Fixed-point combinator Theoretical computer science Mathematical logic Mathematics
139	The Ackermann Award 2007 M. Grohe, M. Hyland, J.A. Makowsky, and D. Niwinski Members of EACSL Jury for the Ackermann Award? The third Ackermann Award is presented at this CSL’07. This is the first year in which the EAC Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2013-12-08 17:58:05 Mathematics Decidability Presburger arithmetic Automated theorem proving Natural deduction Wilhelm Ackermann Quantifier elimination Modal logic Deep inference Proof theory Logic Mathematical logic
140	Redirecting Proofs by Contradiction Jasmin Christian Blanchette Technische Universität München, Germany Abstract This paper presents an algorithm that redirects proofs by contradiction. The input is a refutation graph, Add to Reading List Source URL: www21.in.tum.de Language: English - Date: 2013-05-17 11:36:21 Proof theory Automated theorem proving Rules of inference Mathematical proofs Sequent Natural deduction Proof by contradiction Resolution First-order logic Logic Mathematics Mathematical logic

UPDATE